Efficient computation of tr{TR-1} for Toeplitz matrices
نویسندگان
چکیده
منابع مشابه
On the computation of the nullspace of Toeplitz–like matrices
The knowledge of the nullspace and its size of some structured matrices, like Hankel and Toeplitz matrices, is important in many applications arising in system theory. In this paper we describe an algorithm to compute the kernel of Toeplitz and Hankel matrices based on the generalized Schur algorithm.
متن کاملEfficient Computation of Template Matrices
The computation of template matrices is the bottleneck of simple algorithms for perfect phylogeny haplotyping and for perfect phylogeny under mutation and constrained recombination. The fastest algorithms known so far compute them in O(nm) time. In this paper, we describe an algorithm for computing template matrices in O(nm/ log(n)) time. We also present and discuss a conjecture that implies an...
متن کاملA fast algorithm for ∈R-1 factorization of Toeplitz matrices
In this paper a new order recursive algorithm for the efficient 9B-l factorization of Toeplitz matrices is described. The proposed algorithm can be seen as a fast modified Gram-Schmidt method which recursively computes the orthonormal columns si, i = 1,2, . ,p, of 1, as well as the elements of WI, of a Toeplitz matrix X with dimensions L x p. The 2 factor estimation requires 8Lp MADS (multiplic...
متن کاملAn application of Fibonacci numbers into infinite Toeplitz matrices
The main purpose of this paper is to define a new regular matrix by using Fibonacci numbers and to investigate its matrix domain in the classical sequence spaces $ell _{p},ell _{infty },c$ and $c_{0}$, where $1leq p
متن کاملHigh Performance Algorithms for Toeplitz and block Toeplitz matrices
High Performance Algorithms for Toeplitz and block Toeplitz matrices
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2002
ISSN: 1070-9908,1558-2361
DOI: 10.1109/97.991137